Performance Based Comparison Study of RSA and Elliptic Curve Cryptography
نویسندگان
چکیده
Network is a collection of interconnected nodes which are spread over a large region. A node can be any device such as personal computer, mobile phone, tablet, WAP devices, pager, etc. Data is transmitted over channel of this network, which is prone to security threats such as loss of confidentiality, loss of integrity, fabrication attacks, etc. So, there is a need to secure this data transmission. It is achieved through Cryptography This paper introduces RSA algorithm and its concept in brief, and then proceeds to discuss Elliptic Curve Cryptography (ECC). The future scope of ECC has been pondered upon. In the process, a brief overview of Cryptosystems and different Cryptographic algorithms has been given. We have touched upon Symmetric Algorithms, which were based on the concept of using a common key. Brief details about Public Key Cryptography, a brainchild of Diffie and Hellman, have also been given. .RSA is one of the effective public key cryptographic algorithms, which needs time and memory; on the other hand ECC provides a strong alternative with its subtle features. Many research papers have been submitted on this cryptographic algorithm. Each paper has different perspective.
منابع مشابه
The new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملApplications and Benefits of Elliptic Curve Cryptography
This paper covers relatively new and emerging subject of the elliptic curve crypto systems whose fundamental security is based on the algorithmically hard discrete logarithm problem. Work includes the study of the following issues: mathematical background of the elliptic curve crypto systems, discrete logarithm problem, practical use cases in the industry, common implementation mistakes, perfor...
متن کاملDPA Countermeasures by Improving the Window Method
We propose three differential power analysis (DPA) countermeasures for securing the public key cryptosystems. All countermeasures are based on the window method, and can be used in both RSA and elliptic curve cryptosystems (ECC). By using the optimal countermeasure, performance penalty is small. In comparison with k-ary method, computation time of our countermeasure is only 105% in 1024-bit RSA...
متن کاملElliptic curve cryptography
Public-key cryptography is based on the intractability of certain mathematical problems. Early public-key systems, such as the RSA algorithm, are secure assuming that it is difficult to factor a large integer composed of two or more large prime factors. For elliptic-curve-based protocols, it is assumed that finding the discrete logarithm of a random elliptic curve element with respect to a publ...
متن کامل1 Elliptic Curve Cryptosystem and its Applications
The goal of this research is to develop a basis for utilizing efficient encryption schemes in wireless communications and in devices with low computing power and resources. Elliptic Curve Cryptography (ECC) fits well for an efficient and secure encryption scheme. It is more efficient than the ubiquitous RSA based schemes because ECC utilizes smaller key sizes for equivalent security. A comparat...
متن کامل